A Directed Random Paragraph Generator

نویسندگان

  • Stanley Y. W. Su
  • Kenneth E. Harper
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Generation of Deterministic Acyclic Automata Using the Recursive Method

In this article, we propose a uniform random generator for accessible deterministic acyclic automata with n states, which is based on the recursive method. The generator has a preprocessing that requires O(n) arithmetic operations, and, once it is done, can generate acyclic automata using O(n) arithmetic operations for each sample. We also propose a lazy version of the algorithm that takes adva...

متن کامل

Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem

Motivated by Reingold’s recent deterministic log-space algorithm for UNDIRECTED S-T CONNECTIVITY (ECCC TR 04-94), we revisit the general RL vs. L question, obtaining the following results. 1. We exhibit a new complete problem for RL: S-T CONNECTIVITY restricted to directed graphs for which the random walk is promised to have polynomial mixing time. 2. Generalizing Reingold’s techniques, we pres...

متن کامل

DAGmar: Library for DAGs

We provide a highly configurable generator for creating random directed acyclic graphs and level graphs. The graphs are drawn uniformly from the set of all possible graphs respecting the provided parameter set. Generating a structured set of benchmark graphs is a built-in feature.

متن کامل

A mathematical analysis of the R-MAT random graph generator

The R-MAT graph generator introduced by Chakrabarti, Faloutsos, and Zhan [6] offers a simple, fast method for generating very large directed graphs. These properties have made it a popular choice as a method of generating graphs for objects of study in a variety of disciplines, from social network analysis to high performance computing. We analyze the graphs generated by R-MAT and model the gen...

متن کامل

Contextual Approach for Paragraph Selection in Question Answering Task

This year we participated in the English monolingual paragraph selection task at ResPubliQA 2010. Our general strategy is to find the supporting word context from query and candidate passages during the paragraph selection. We use the techniques of state-of-the art publicly available question answering systems, i.e. Open Ephyra and JIRS, and the random projection implementation in the Semantic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1969